Bi-cyclic decompositions of complete graphs into spanning trees
نویسنده
چکیده
We examine decompositions of complete graphs with an even number of vertices, K2n, into n isomorphic spanning trees. While methods of such decompositions into symmetric trees have been known, we develop here a more general method based on a new type of vertex labelling, called flexible q-labelling. This labelling is a generalization of labellings introduced by Rosa and Eldergill.
منابع مشابه
Trees with Α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees
We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, which allow factorization of K2n into spanning trees, arising from the trees with α-labelings.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملReducible and purely heterogeneous decompositions of uniform complete multigraphs into spanning trees
Let K (r) n be the order n uniform complete multigraph with edge multiplicity r. A spanning tree decomposition of K (r) n partitions its edge set into a family T of edge-induced spanning trees. In a purely heterogeneous decomposition T no trees are isomorphic. Every order n tree occurs in a fully heterogeneous decomposition T. All trees have equal multiplicity in a balanced decomposition T. We ...
متن کاملSize-Constrained Tree Decompositions
Tree-Decompositions are the corner-stone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute tree-decompositions with small width. However, practical algorithms computing tree-decompositions only exist for graphs with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2004